نتایج جستجو برای: capacitated location routing problem

تعداد نتایج: 1118891  

Journal: :international journal of industrial engineering and productional research- 0
yahia zare mehrjerdi department of industrial engineering, yazd university yazd iran ali nadizadeh

using greedy clustering method to solve capacitated location-routing problem with fuzzy demands abstract in this paper, the capacitated location routing problem with fuzzy demands (clrp_fd) is considered. in clrp_fd, facility location problem (flp) and vehicle routing problem (vrp) are observed simultaneously. indeed the vehicles and the depots have a predefined capacity to serve the customerst...

Ali Nadizadeh, Yahia Zare Mehrjerdi,

Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands Abstract In this paper, the capacitated location routing problem with fuzzy demands (CLRP_FD) is considered. In CLRP_FD, facility location problem (FLP) and vehicle routing problem (VRP) are observed simultaneously. Indeed the vehicles and the depots have a predefined capacity to serve the customerst...

Journal: :international journal of industrial mathematics 0
a. ‎nadizadeh‎‎ department ‎of industrial engineering, faculty of engineering, ardakan university, ardakan, ‎iran‎. a. sadegheih industrial engineering department, faculty of engineering, yazd university, yazd, ‎iran‎. a. sabzevari ‎zadeh‎ industrial engineering department, faculty of engineering, shahed university, tehran, ‎iran.‎

in this paper, the capacitated location-routing problem with fuzzy demands (clrp-fd) is considered. the clrp-fd is composed of two well-known problems: facility location problem and vehicle routing problem. the problem has many real-life applications of which some have been addressed in the literature such as management of hazardous wastes and food and drink distribution. in clrp-fd, a set of c...

Journal: :International Journal of Advanced Computer Science and Applications 2016

Journal: :journal of advances in computer research 2016
arash mazidi mostafa fakhrahmad mohammadhadi sadreddini

the capacitated vehicle routing problem (cvrp) is a well-known combinatorial optimization problem that holds a central place in logistics management. the vehicle routing is an applied task in the industrial transportation for which an optimal solution will lead us to better services, save more time and ultimately increase in customer satisfaction. this problem is classified into np-hard problem...

Journal: :Operations Research 1995
Julien Bramel David Simchi-Levi

We present a general framework for modeling routing problems based on formulating them as a traditional location problem called the Capacitated Concentrator Location Problem. We apply this framework to two classical routing problems: the Capacitated Vehicle Routing Problem and Inventory-Routing Problem. In the former case, the heuristic is proven to be asymptotically optimal for any distributio...

Journal: :مهندسی صنایع 0
علی¬رضا محمدی شاد دانش آموخته کارشناسی ارشد مهندسی صنایع- دانشگاه بوعلی سینا پرویز فتاحی دانشیار و مدیر گروه مهندسی صنایع- دانشگاه بوعلی سینا

the capacitated location-routing problem (clrp) is a new research area in logistics and distribution management. this problem combines two difficult problems: the facility location problem (flp) and vehicle routing problem (vrp). the goal of the clrp is to open a subset of depots, assign the customers into open facilities, and then design vehicle tours in order to minimize the total cost. the t...

The location-routing problem is one of the combined problems in the area of supply chain management that simultaneously make decisions related to location of depots and routing of the vehicles. In this paper, the single-depot capacitated location-routing problem under uncertainty is presented. The problem aims to find the optimal location of a single depot and the routing of vehicles to serve th...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید